Application of the Hungarian Algorithm in Baseball Team Selection and Assignment
نویسندگان
چکیده
Measuring and comparing the performance of athletes in all forms of team sports require more than a modest amount of data reflecting the athletes' abilities. When investigating the skill of baseball players in South Africa, however, one has to make do with a combination of personal opinion, gut feeling and a few descriptive statistics. This research is aimed at developing a system with which to assess the abilities of baseball players in all practical aspects of the sport and compose a team in which all the players are assigned to positions such that the collective team skill is maximised for a specific goal. The system itself is of such a nature that any group of baseball players can apply it, with some help from a statistician. The optimisation process that selects the team is carried out using the Hungarian algorithm, a mathematical method of optimally assigning a set of persons to a set of jobs.
منابع مشابه
Assignment problem and its application in Nigerian institutions: Hungarian method approach
Assignment model is a powerful operations research techniques that can be used to solve assignment or allocation problem. This study applies the assignment model to the course allocation problem in Nigeria tertiary institution in order to maximize lecturers’ effectiveness. A well-structured questionnaire was used to obtain data from lecturers and solved with Hungarian method. The study revealed...
متن کاملPower Control and Scheduling For Low SNR Region in the Uplink of Two Cell Networks
In this paper we investigate the sub-channel assignment and power control to maximize the total sum rate in the uplink of two-cell network. It is assumed that there are some sub-channels in each cell which should be allocated among some users. Also, each user is subjected to a power constraint. The underlying problem is a non-convex mixed integer non-linear optimization problem which does not h...
متن کاملAn Approach for Solving Traveling Salesman Problem
In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...
متن کاملAn Improved Assignment Algorithm Based Rotational Angular Sorting Methods
The data assignment problem occurs for multiple targets tracking application. It is crucial for the overall performance. In this paper, two observations of date assignment are considered, and then a new rotational sorting algorithm based on maximum likelihood principle was presented. The given algorithm of O(logN) and O(N) complexity developed is faster than the more popularly used Hungarian ty...
متن کاملGeometric topology based cooperation for multiple robots in adversarial environments
This paper addresses the cooperation problem for a team of mobile robots in adversarial environments. Considering the mutual influence among the robots, two key factors are defined: the impact factor and the suffering factor. A stochastic assignment model is built, based on the geometric topology of the targets, through which the robots can exhibit temporal cooperation. To reduce computational ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011